An algorithm for recognition of n-collapsing words
نویسنده
چکیده
A word w over a finite alphabet Σ is n-collapsing if for an arbitrary deterministic finite automaton A = 〈Q,Σ, δ〉, the inequality |δ(Q,w)| ≤ |Q| − n holds provided that |δ(Q, u)| ≤ |Q| − n for some word u ∈ Σ (depending on A ). We prove that the the property of being n-collapsing is algorithmically recognizable for any given positive integer n. We also prove that the language of all n-collapsing words is context-sensitive.
منابع مشابه
Facial expression recognition based on Local Binary Patterns
Classical LBP such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. In this paper, we introduce an improved LBP algorithm to solve these problems that utilizes Fast PCA algorithm for reduction of vector dimensions of extracted features. In other words, proffer method (Fast PCA+LBP) is an improved LBP algorithm that is extracted ...
متن کاملیک روش دو مرحلهای برای بازشناسی کلمات دستنوشته فارسی به کمک بلوکبندی تطبیقی گرادیان تصویر
This paper presented a two step method for offline handwritten Farsi word recognition. In first step, in order to improve the recognition accuracy and speed, an algorithm proposed for initial eliminating lexicon entries unlikely to match the input image. For lexicon reduction, the words of lexicon are clustered using ISOCLUS and Hierarchal clustering algorithm. Clustering is based on the featur...
متن کاملتشخیص دست‌نوشتۀ برخط فارسی با استفاده از مدل زبانی و کاهش قوانین نگارش کاربر
The Joint-up, cursive form of Persian words and immense variety of its scripts, also different figures of Persian letters depending on their sitting positions in the words, have turned the Persian handwritings recognition to an intense challenge. The major obstacle of the most often recognition ways, is their inattention to sentence contexture which causes utilizing of a word with correct appea...
متن کاملA Combinatorial Approach to Collapsing Words
Introduction New characterization Recognizing collapsing words Mono and stereo automata Questions Definitions We will consider finite deterministic automata with a total transition function: Remark Each element of Σ induces via δ a transformation of Q. We will view an automaton as a set of such transformations. Introduction New characterization Recognizing collapsing words Mono and stereo autom...
متن کاملImage reducing words and subgroups of free groups
A word w over a *nite alphabet is said to be n-collapsing if for an arbitrary *nite automaton A = 〈Q; −·−〉, the inequality |Q ·w|6 |Q| − n holds provided that |Q · u|6 |Q| − n for some word u (depending on A). We give an algorithm to test whether a word is 2-collapsing. To this aim we associate to every word w a *nite family of *nitely generated subgroups in *nitely generated free groups and pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 391 شماره
صفحات -
تاریخ انتشار 2008